Bidding Strategies Analysis for Procurement Combinatorial Auctions
نویسندگان
چکیده
Based on the work of Krishna and Rosenthal (1996) about combinatorial auctions bidding equilibrium analysis and Che(1993)’s research about one-unit multi-attributes auctions, we construct a multi-attributes procurement simultaneous auction for 2 objects, through a first-score(price), sealed-bid format. There are two kinds of bidders: simple bidders and a diverse bidder considered in this model. Each simple bidder is interested in only one of the objects, while the diverse bidder is interested in both. With some further assumptions, we finally obtain the equilibrium bidding strategies for the both two kinds of bidders.
منابع مشابه
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملCombinatorial Auctions for Trucking Service Procurement: An Examination of Carrier Bidding Policies
Combinatorial auctions are increasingly used by large shippers as a method to establish service contracts with trucking companies. In order to achieve maximal benefits in these auctions, carriers must determine a bidding policy that can accurately evaluate the costs they will incur to fulfil these contracts and which can quickly examine many different possible options. In this paper, we analyze...
متن کاملCarrier Bidding Strategies for Iterative Auctions for Transportation Services
Transportation service procurement auctions are typically characterized by limited number of rounds and low profit margin. In this paper we address the bid determination problem for single-lane and combinatorial bids in the successive rounds of an auction, which maximizes the profit and also ensures winning. A profit factor (PF) is computed at each round using the industry average price for thi...
متن کاملAn exact and two heuristic strategies for truthful bidding in combinatorial transport auctions
To support a freight carrier in a combinatorial transport auction, we proposes an exact and two heuristic strategies for bidding on subsets of requests. The exact bidding strategy is based on the concept of elementary request combinations. We show that it is sufficient and necessary for a carrier to bid on each elementary request combination in order to guarantee the same result as bidding on e...
متن کاملSolving Truckload Procurement Auctions Over an Exponential Number of Bundles
Truckload carriers provide hundreds of $billions worth of services to shippers in the U.S. alone each year. Internet auctions provide these shippers with a fast, easy way to negotiate potential contracts with a large number of carriers. Combinatorial auctions have the added benefit of allowing multiple loads to be considered simultaneously in a single auction. This is important because it enabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004